# 给定一个字符串，你需要反转字符串中每个单词的字符顺序，同时仍保留空格和单词的初始顺序。
#
#
#
#  示例：
#
#  输入："Let's take LeetCode contest"
# 输出："s'teL ekat edoCteeL tsetnoc"
#
#
#
#
#  提示：
#
#
#  在字符串中，每个单词由单个空格分隔，并且字符串中不会有任何额外的空格。
#
#  Related Topics 字符串
#  👍 229 👎 0


# leetcode submit region begin(Prohibit modification and deletion)
class Solution(object):
    def reverseWords(self, s):
        """
        :type s: str
        :rtype: str
        """
        words = s.split(" ")
        for i in range(0, len(words)):
            words[i] = words[i][::-1]

        return " ".join(words)

    # leetcode submit region end(Prohibit modification and deletion)


print(Solution().reverseWords("Let's take LeetCode contest"))
